27 Mean cordiality of some snake graphs.dvi
نویسندگان
چکیده
Let f be a function from the vertex set V (G) to {0, 1, 2}. For each edge uv assign the label ⌈
منابع مشابه
4-Prime cordiality of some classes of graphs
Let G be a (p, q) graph. Let f : V (G) → {1, 2, . . . , k} be a map. For each edge uv, assign the label gcd (f(u), f(v)). f is called k-prime cordial labeling of G if |vf (i) − vf (j)| ≤ 1, i, j ∈ {1, 2, . . . , k} and |ef (0) − ef (1)| ≤ 1 where vf (x) denotes the number of vertices labeled with x, ef (1) and ef (0) respectively denote the number of edges labeled with 1 and not labeled with 1....
متن کامل26 Total Mean Cordiality of.dvi
A Total Mean Cordial labeling of a graph G = (V,E) is a mapping f : V (G) → {0, 1, 2} such that f(xy) = ⌈
متن کاملGeneralized graph cordiality
Hovey introduced A-cordial labelings in [4] as a simultaneous generalization of cordial and harmonious labelings. If A is an abelian group, then a labeling f : V (G) → A of the vertices of some graph G induces an edgelabeling on G; the edge uv receives the label f(u) + f(v). A graph G is A-cordial if there is a vertex-labeling such that (1) the vertex label classes differ in size by at most one...
متن کاملEpidemiology of Snake, Spider and Scorpion Envenomation in Mashhad, Khorasan Razavi, Iran (2004-2011)
Backgrounds: Envenomation is common in Asia including Iran that induces morbidity and mortality. This study investigated the epidemiological characteristics of cases with snake, spider and scorpion bites. Methods: In this cross-sectional design, epidemiologic data of admitted cases to the Toxicology Department of Imam Reza Hospital of Mashhad, Iran were analyzed across a 7-yr period, from 2004...
متن کاملVertex Equitable Labeling of Double Alternate Snake Graphs
Let G be a graph with p vertices and q edges and A = {0, 1, 2, . . . , [q/2]}. A vertex labeling f : V (G) → A induces an edge labeling f∗ defined by f∗(uv) = f(u) + f(v) for all edges uv. For a ∈ A, let vf (a) be the number of vertices v with f(v) = a. A graph G is said to be vertex equitable if there exists a vertex labeling f such that for all a and b in A, |vf (a) − vf (b)| ≤ 1 and the indu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2015